Notes in Computer Science 2045
نویسندگان
چکیده
In this paper we present an algorithm for counting points on elliptic curves over a finite field Fpn of small characteristic, based on Satoh’s algorithm. The memory requirement of our algorithm is O(n), where Satoh’s original algorithm needs O(n) memory. Furthermore, our version has the same run time complexity of O(n) bit operations, but is faster by a constant factor. We give a detailed description of the algorithm in characteristic 2 and show that the amount of memory needed for the generation of a secure 200-bit elliptic curve is within the range of current smart card technology.
منابع مشابه
Tv and or Fm Transmitting Antennas Desien Using Computer Graphic System (RESEARCH NOTES)
The purpose of this paper is three fold. First, the major theoretical pattern relationships of TV and/or FM transmitting antennas are dealt with. Secend, the computer calculation method and designing of such patterns using the given relationships. And third, a method in which a computer graphic system can be used to design such antennas for a specific pattern is introduced and its results are p...
متن کاملSome notes concerning the convergence control parameter in homotopy analysis method
omotopy analysis method (HAM) is a promising method for handling func-tional equations. Recent publications proved the eectiveness of HAM in solvingwide variety of problems in dierent elds. HAM has a unique property whichmakes it superior to other analytic methods, this property is its ability to con-trol the convergence region of the solution series. In this work, we claried theadvantages and ...
متن کاملEvidence of the Potential Shift Mechanism in Crevice Corrosion (RESEARCH NOTES)
Previous research has indicated a qualitative resemblance between the current distribution along actively corroding crevice walls and currents measured in corresponding anodic polarization plots. Using detailed measurements of the potential gradient along the crevice, a semi-quantitative current distribution was calculated for the crevice wall using a double numerical differentiation method. Th...
متن کاملLecture Notes in Artificial Intelligence 4451 Edited by J . G . Carbonell and J . Siekmann Subseries of Lecture Notes in Computer Science
متن کامل
Progress in Cryptology - AFRICACRYPT 2011 - 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings
information security practice and experience 10th international conference ispec 2014 fuzhou china may 5-8 2014 proceedings lecture notes in computer science security and cryptology PDF advances in cryptology-asiacrypt 96 international conference on the theory and applications of crypotology and information security kyongju lecture notes in computer science PDF image analysis 17th scandinavian ...
متن کامل